approximation programming

英 [əˌprɒksɪˈmeɪʃn ˈprəʊɡræmɪŋ] 美 [əˌprɑːksɪˈmeɪʃn ˈproʊɡræmɪŋ]

近似规划

计算机



双语例句

  1. Stability of the Optimal Solution Sets of Approximation Problems for Stochastic Programming
    随机规划逼近问题最优解集的稳定性
  2. Approximation algorithm for multi-criterion nonlinear 0-1 programming based on entropy matrix
    基于熵矩阵的多目标非线性0-1规划近似算法
  3. Both the linearization and the approximation process for3D yield function could be removed by adopting nonlinear programming.
    该方法克服了屈服函数的线性化或光滑近似;
  4. As an approximation he should understand enough computer programming.
    他大体上要弄懂足够的计算机程序编制。
  5. Smooth Sample Average Approximation Method for Nonsmooth Stochastic Programming with Constraints
    求解带约束随机规划问题的光滑化样本均值逼近方法
  6. Approximation of Arbitrary Nonlinear Function Using Symbol Express of Genetic Programming
    利用遗传编程的符号表达式逼近任意非线性函数
  7. Economic Load Scheduling of Power System by Successive Approximation Dynamic Programming
    应用逐次逼近动态规划计算水火电力系统经济负荷分配
  8. Parameter successive approximation and dynamic programming are employed to find optimal operating policies for hydro reservoir systems.
    通过参数调整和离散增量动态规划法,求系统目标函数极大化的最优解。
  9. Parameters of the approximation can be determined by solving a convex quadratic programming problem.
    逼近参数的求解可转化为凸二次规划问题。
  10. We give the global optimality conditions of biconcave programming programming problem and structure a outer approximation algorithm for solving the biconcave programming problem with separable linear constraints.
    我们给出了双凹规划问题的整体最优性条件,并构造了一个有限终止外逼近算法。
  11. Approximation Method for Stochastic Programming
    随机规划的逼近方法
  12. This article deals with the basic methods for solving unconstrained and constrained nonlinear problems. It describes also the linear approximation methods of nonlinear programming.
    本文阐明无约束和有约束非线性问题的基本解法,并说明非线性规划的线性近似方法。
  13. The Quadratic Programming Perturbation Approximation Method for the Linear Programming Problem
    求解线性规划问题的二次规划摄动逼近法
  14. Approximation to Fuzzy Programming Problem and Its Solutions
    模糊规划问题的逼近与求解
  15. The approximation solving of a kind of stochastic programming AN APPROXIMATE METHOD FOR STOCHASTIC PROGRAMMING WITH RECOURSE
    一类随机规划问题的逼近求解一种解带补偿的随机规划的逼近方法
  16. The authors propose an approximation method for solving stochastic programming of minimizing the cost expection function with probabilistic constraint conditon, and discuss some kind of convergences.
    提出了一种求解在概率约束条件下极小化价格期望函数的随机规划问题的逼近法,并讨论了该法所具有的某种收敛性。
  17. In this paper, an optimal mathematical model solving method, the successive approximation method, of the nature of nonlinear integral programming problem is suggested.
    本文提出一种求解优化数学模型,属于非线性整数规划问题的方法&逐次近似法。
  18. An Asynchronous Parallel Approximation Algorithm for Solving Stochastic Programming with Simple Recourse
    求解简单补偿随机规划问题的一种异步并行算法
  19. Linear Approximation Algorithm for Bilinear Programming
    一类双线性规划的线性逼近算法
  20. In this paper the power load scheduling problem is discussed with successive approximation dynamic programming ( SADP).
    本文讨论复杂水火电力系统经济负荷分配的逐次逼近动态规划解。
  21. Lower approximation algorithm and its solve of convex quadratic programming are also given in this article.
    混合优化控制算法,给出了求解最优控制器的上逼近算法及其凸二次规划求解方法。
  22. An Approximation Method for Solving A Class of Probability Constrained Programming
    求解某类概率约束规划的一种逼近法
  23. Circular arc spline approximation for auto programming profiles of machine parts
    圆弧样条逼近为机械零件几何轮廓的自动编程
  24. Convergence of Saddle-Point Approximation Algorithm for Linear Programming
    线性规划鞍点逼近算法的收敛性
  25. An accelerated successive approximation method of discounted Markovian decision programming and the least variance problem in optimal policies
    马氏决策规划的加速逼近算法与最小方差问题
  26. And then, we present an approximation method for solving this probabilistic constrained stochastic programming, and prove certain convergence of the method under some conditions.
    随后我们提出了求解这类概率约束随机规划的一种近似算法,并在一定的条件下证明了算法的收敛性。
  27. By the approximation values of potentials and approximation policy iteration, a unified neuro-dynamic programming ( NDP) optimization approach is consequently proposed for both two criteria.
    然后,根据性能势的逼近值,通过逼近策略迭代来实现两种准则下统一的神经元动态规划(neuro-Dynamicprogramming,NDP)优化方法。
  28. The approximation algorithm obtains the approximate optimal solution of the integer linear programming, through a series of linear programming.
    该近似算法通过一系列的线性规划来得到整数线性规划最优解的近似解。
  29. From two aspects of better approximation and easier programming, this paper studied the parameter estimation algorithms for simulation models.
    从逼近性较好和易于计算机实现两个角度,对仿真模型中参数估计方法进行研究。
  30. An optimal control algorithm: H2/ l1 mixed optimal control which about two index of performance is given. Lower approximation algorithm and its solve of convex quadratic programming are also given in this article. 4.
    同时还给出了一个针对两种性能指标的最优控制算法:H/V;混合优化控制算法,给出了求解最优控制器的上逼近算法及其凸二次规划求解方法。